Individual Equilibrium and Learning in Processor Sharing Systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Individual Equilibrium and Learning in Processor Sharing Systems

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

متن کامل

Individual Equilibrium and Learning in aProcessor Sharing System 1

We consider a processor-sharing service station which serves all its customers simultaneously , with the service rate to individual customers decreasing as the load increases. Each arriving customer observes the current load, and may then choose to join the shared system or use an alternative service option { modeled here as a private server (e.g., a personal computer, as an alternative to a ce...

متن کامل

Load balancing in processor sharing systems

In this paper, we investigate optimal load balancing strategies for a multi-class multi-server processor-sharing system with a Poisson input stream, heterogeneous service rates, and a server-dependent holding cost per unit time. Specifically, we study (i) the centralized setting in which a dispatcher routes incoming jobs based on their service time requirements so as to minimize the weighted me...

متن کامل

Whittle Indexability in Egalitarian Processor Sharing Systems

The egalitarian processor sharing model is viewed as a restless bandit and its Whittle indexability is established. A numerical scheme for computing the Whittle indices is provided, along with supporting numerical experiments.

متن کامل

Poly-symmetry in processor-sharing systems

We consider a system of processor-sharing queues with state-dependent service rates. These are allocated according to balanced fairness within a polymatroid capacity set. Balanced fairness is known to be both insensitive and Pareto-efficient in such systems, which ensures that the performance metrics, when computable, will provide robust insights into the real performance of the system consider...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 1998

ISSN: 0030-364X,1526-5463

DOI: 10.1287/opre.46.6.776